TACO: A Scheduling Scheme for Parallel Applications on Multicore Architectures
نویسندگان
چکیده
منابع مشابه
Scheduling Dynamic OpenMP Applications over Multicore Architectures
Approaching the theoretical performance of hierarchical multicore machines requires a very careful distribution of threads and data among the underlying non-uniform architecture in order to minimize cache misses and NUMA penalties. While it is acknowledged that OpenMP can enhance the quality of thread scheduling on such architectures in a portable way, by transmitting precious information about...
متن کاملEnergy-Aware Scheduling for Parallel Applications on Multicore Systems
This chapter discusses energy-aware scheduling techniques for parallel applications on multicore computers. Key techniques for developing an energy-aware scheduler, such as estimation of power usage and performance features per application, are analyzed and evaluated. The authors first discuss the runtime profiling techniques for collecting detailed application-specific information to be used b...
متن کاملParallel MLEM on Multicore Architectures
The efficient use of multicore architectures for sparse matrixvector multiplication (SpMV) is currently an open challenge. One algorithm which makes use of SpMV is the maximum likelihood expectation maximization (MLEM) algorithm. When using MLEM for positron emission tomography (PET) image reconstruction, one requires a particularly large matrix. We present a new storage scheme for this type of...
متن کاملDesign and Implementation of a Cache Hierarchy-aware Task Scheduling for Parallel Loops on Multicore Architectures
Effective cache utilization is critical to performance in chip-multiprocessor systems (CMP). Modern CMP architectures are based on hierarchical cache topology with varying private and shared caches configurations at different levels. Cache-aware scheduling has become a great design challenge. Many scheduling strategies have been designed to target specific cache configuration. In this paper we ...
متن کاملParallel Graph Partitioning on Multicore Architectures
Graph partitioning is a common and frequent preprocessing step in many high-performance parallel applications on distributedand shared-memory architectures. It is used to distribute graphs across memory and to improve spatial locality. There are several parallel implementations of graph partitioning for distributed-memory architectures. In this paper, we present a parallel graph partitioner tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific Programming
سال: 2014
ISSN: 1058-9244,1875-919X
DOI: 10.1155/2014/423084